Comments on 'MMFPh: A Maximal Motif Finder for Phosphoproteomics Datasets'
نویسندگان
چکیده
The discovery of phosphorylation motifs helps to understand the underlying regulation mechanism and to facilitate the prediction of unknown phosphorylation sites. Several methods have been proposed to detect phosphorylation motifs from phosphoproteomics datasets. A recent article (Wang et al. 2012) published in Bioinformatics developed a new method MMFPh (Maximal Motif Finder for Phosphoproteomics Datasets), which aims at identifying all statistically significant motifs and returns the maximal ones (those not subsumed by motifs with more fixed amino acids). The empirical comparison with Motif-X (Schwartz and Gygi, 2005) and Motif-All (He et al. 2011) showed that MMFPh is able to find more important motifs than Motif-X and return less false positives than Motif-All. Both Motif-All and MMFPh claimed that they can identify all statistically significant motifs. However, the lack of a precise problem definition and the ‘completeness’ definition may bring some confusions for users to select the appropriate method for their tasks. In this letter, we like to clarify the difference of these two methods and show that MMFPh cannot find all (maximal) statistically significant motifs even with respect to their own completeness definition.
منابع مشابه
MMFPh: a maximal motif finder for phosphoproteomics datasets
MOTIVATION Protein phosphorylation, driven by specific recognition of substrates by kinases and phosphatases, plays central roles in a variety of important cellular processes such as signaling and enzyme activation. Mass spectrometry enables the determination of phosphorylated peptides (and thereby proteins) in scenarios ranging from targeted in vitro studies to in vivo cell lysates under parti...
متن کاملMotifVoter: a novel ensemble method for fine-grained integration of generic motif finders
MOTIVATION Locating transcription factor binding sites (motifs) is a key step in understanding gene regulation. Based on Tompa's benchmark study, the performance of current de novo motif finders is far from satisfactory (with sensitivity <or=0.222 and precision <or=0.307). The same study also shows that no motif finder performs consistently well over all datasets. Hence, it is not clear which f...
متن کاملSelf-organizing neural networks to support the discovery of DNA-binding motifs
Identification of the short DNA sequence motifs that serve as binding targets for transcription factors is an important challenge in bioinformatics. Unsupervised techniques from the statistical learning theory literature have often been applied to motif discovery, but effective solutions for large genomic datasets have yet to be found. We present here three self-organizing neural networks that ...
متن کاملFinding Motif Sets in Time Series
Time-series motifs are representative subsequences that occur frequently in a time series; a motif set is the set of subsequences deemed to be instances of a given motif. We focus on finding motif sets. Our motivation is to detect motif sets in household electricity-usage profiles, representing repeated patterns of household usage. We propose three algorithms for finding motif sets. Two are gre...
متن کاملDevelopment of an Efficient Hybrid Method for Motif Discovery in DNA Sequences
This work presents a hybrid method for motif discovery in DNA sequences. The proposed method called SPSO-Lk, borrows the concept of Chebyshev polynomials and uses the stochastic local search to improve the performance of the basic PSO algorithm as a motif finder. The Chebyshev polynomial concept encourages us to use a linear combination of previously discovered velocities beyond that proposed b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Bioinformatics
دوره 28 16 شماره
صفحات -
تاریخ انتشار 2012